SPACE-EFFICIENT INDEXING OF CHESS ENDGAME TABLES1

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chess Endgame Knowledge Advances

It is advisable to refer to the publisher's version if you intend to cite from the work. All outputs in CentAUR are protected by Intellectual Property Rights law, including copyright law. Copyright and IPR is retained by the creators or other copyright holders. Terms and conditions for use of this material are defined in the End User Agreement .

متن کامل

Chess Endgame Update

John Nunn received the EGT for KRPKNP just in time to analyse the subtleties of the Kramnik-Topalov World Chess Championship Game 2 (Chessbase, 2006a) which saw the players trade a half point back and forth at moves 53b and 55w. In a demonstration of the power of the web-fuelled community, all 6-man endgame tables have now been promulgated to a considerable degree by Kyrill Kryukov's (2008) pee...

متن کامل

UMRAO: A Chess Endgame Tutor

Most research in computer chess has focussed on creating an excellent chess player, with relatively little concern given to modelling how humans play chess. The research reported in this paper is aimed at investigating knowledge-based chess in the context of building a prototype chess tutor, UMRAO, which helps students learn how to play bishop-pawn endgames. In tutoring it is essential to take ...

متن کامل

Conflict Resolution of Chinese Chess Endgame Knowledge Base

Endgame heuristics are often incorperated as part of the evaluation function used in Chinese chess programs. In our program, Contemplation, we have proposed an automatic strategy to construct a large set of endgame heuristics. In this paper, we propose a conflict resolution strategy to eliminate the conflicts among the constructed heuristic database, which is called endgame knowledge base. In o...

متن کامل

Evaluating a Parallel Evolutionary Algorithm on the Chess Endgame Problem

Classifying the endgame positions in Chess can be challenging for humans and is known to be a difficult task in machine learning. An evolutionary algorithm would seem to be the ideal choice. We describe our implementation of a parallel island model and evaluate it in the context of the Chess Endgame data set from the UCI machine learning repository. We are mainly interested in impact of paralle...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ICGA Journal

سال: 2000

ISSN: 1389-6911,2468-2438

DOI: 10.3233/icg-2000-23304